package com.test.daily.leetcode.y2021.m11.day1107;

/**
 * @descriptions: maxCount
 * @author: Tom
 * @date: 2021/11/7 下午 03:56
 * @version: 1.0
 */
public class Code01_MaxCount {
    public int maxCount(int m, int n, int[][] ops){
        int a = m;
        int b = n;
        for(int i = 0; i < ops.length; i++){
            a = Math.min(a, ops[i][0]);
            b = Math.min(b, ops[i][1]);
        }
        return a * b;
    }
}
